Security invariants in discrete transition systems
نویسندگان
چکیده
منابع مشابه
Some invariants of discrete-time descriptor systems
Many papers analyze the role of controllability and observability indices of normal linear systems in control theory and their use in the study of structural properties. This work introduces these indices for linear discrete-time descriptor systems. Such indices are studied in two different ways, by means of the state-space approach and using its transfer matrix . A canonical form of the state-...
متن کاملRecent Developments in Discrete Event Systems
This article is a brief exposure of the process approach to a newly emerging area called "discrete event systems" in control theory and summarizes some of the recent developments in this area. Discrete event systems is an area of research that is developing within the interstices of computer, control and communication sciences. The basic direction of research addresses issues in the analysis an...
متن کاملControlling Wild Bodies Using Discrete Transition Systems
This paper proposes methods for achieving basic tasks such as navigation, patrolling, herding, and coverage by exploiting the wild motions of very simple bodies in the environment. Bodies move within regions that are connected by gates that enforce specific rules of passage. This leads to a hybrid systems approach in which the behaviors define a discrete transition system. Tasks can even be spe...
متن کاملDeductive Verification of Invariants of State-Transition Systems
We present a modular technique to prove invariants of state-transition systems in a deductive framework. We show how the semantic knowledge of the given problem can be generically used to decompose the problem into modular tasks which can be successfully tackled with the help of techniques developed in the eld of inductive theorem proving. As an example we present the mechanical veriication of ...
متن کاملTemporal verification with transition invariants
Program verification increases the degree of confidence that a program will perform correctly. Manual verification is an error-prone and tedious task. Its automation is highly desirable. The verification methodology reduces the reasoning about temporal properties of program computations to testing the validity of implication between auxiliary first-order assertions. The synthesis of such auxili...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formal Aspects of Computing
سال: 2012
ISSN: 0934-5043,1433-299X
DOI: 10.1007/s00165-012-0256-1